Saddle point least squares preconditioning of mixed methods

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A saddle point least squares approach to mixed methods

We investigate new PDE discretization approaches for solving variational formulations with different types of trial and test spaces. The general mixed formulation we consider assumes a stability LBB condition and a data compatibility condition at the continuous level. We expand on the Bramble-Pasciak’s least square formulation for solving such problems by providing new ways to choose approximat...

متن کامل

Preconditioning Mixed Finite Element Saddle-point Elliptic Problems

We consider saddle-point problems that typically arise from the mixed finite element discretization of second order elliptic problems. By proper equivalent algebraic operations the considered saddle-point problem is transformed to another saddle-point problem. The resulting problem can then be efficiently preconditioned by a block-diagonal matrix or by a factored block-matrix (the blocks corres...

متن کامل

Natural Preconditioning and Iterative Methods for Saddle Point Systems

The solution of quadratic or locally quadratic extremum problems subject to linear(ized) constraints gives rise to linear systems in saddle point form. This is true whether in the continuous or discrete setting, so saddle point systems arising from the discretization of partial differential equation problems, such as those describing electromagnetic problems or incompressible flow, lead to equa...

متن کامل

Approximate Generalized Inverse Preconditioning Methods for Least Squares Problems

iv erative methods to solve least squares problems more efficiently. We especially focused on one kind of preconditioners, in which preconditioners are the approximate generalized inverses of the coefficient matrices of the least squares problems. We proposed two different approaches for how to construct the approximate generalized inverses of the coefficient matrices: one is based on the Minim...

متن کامل

Some Preconditioning Techniques for Saddle Point Problems

Saddle point problems arise frequently in many applications in science and engineering, including constrained optimization, mixed finite element formulations of partial differential equations, circuit analysis, and so forth. Indeed the formulation of most problems with constraints gives rise to saddle point systems. This paper provides a concise overview of iterative approaches for the solution...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Mathematics with Applications

سال: 2019

ISSN: 0898-1221

DOI: 10.1016/j.camwa.2018.11.013